Mixing rates for Hamiltonian Monte Carlo algorithms in finite and infinite dimensions

نویسندگان

چکیده

We establish the geometric ergodicity of preconditioned Hamiltonian Monte Carlo (HMC) algorithm defined on an infinite-dimensional Hilbert space, as developed in Beskos et al. (Stoch Process Appl 121(10):2201–2230, 2011). This can be used a basis to sample from certain classes target measures which are absolutely continuous with respect Gaussian measure. Our work addresses open question posed (2011), and provides alternative recent proof based exact coupling techniques given Bou-Rabee Eberle (Two-scale for infinite dimensions , 2019). The approach here establishes convergence suitable Wasserstein distance by using weak Harris theorem together generalized argument. also show that law large numbers central limit derived consequence our main result. Moreover, yields novel mixing rates classical finite-dimensional HMC algorithm. As such, methodology we develop flexible framework tackle rigorous other Markov Chain algorithms. Additionally, scope result includes arise Bayesian inverse PDE problems, cf. Stuart (Acta Numer 19:451–559, 2010). Particularly, verify all required assumptions class problems involving recovery divergence free vector field passive scalar, Borggaard (SIAM/ASA J Uncertain Quant 8(3):1036–1060, 2020).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiorbital Hubbard model in infinite dimensions: Quantum Monte Carlo calculation

Using the quantum Monte Carlo technique we compute thermodynamics and spectra for the orbitally degenerate Hubbard model in infinite spatial dimensions. With increasing orbital degeneracy we find in the one-particle spectra broader Hubbard bands ~consistent with increased kinetic energy!, a narrowing Mott gap, and increasing quasiparticle spectral weight. Hund’s rule exchange coupling decreases...

متن کامل

Magnetic Hamiltonian Monte Carlo

Hamiltonian Monte Carlo (HMC) exploits Hamiltonian dynamics to construct efficient proposals for Markov chain Monte Carlo (MCMC). In this paper, we present a generalization of HMC which exploits non-canonical Hamiltonian dynamics. We refer to this algorithm as magnetic HMC, since in 3 dimensions a subset of the dynamics map onto the mechanics of a charged particle coupled to a magnetic field. W...

متن کامل

Wormhole Hamiltonian Monte Carlo

In machine learning and statistics, probabilistic inference involving multimodal distributions is quite difficult. This is especially true in high dimensional problems, where most existing algorithms cannot easily move from one mode to another. To address this issue, we propose a novel Bayesian inference approach based on Markov Chain Monte Carlo. Our method can effectively sample from multimod...

متن کامل

Split Hamiltonian Monte Carlo

We show how the Hamiltonian Monte Carlo algorithm can sometimes be speeded up by “splitting” the Hamiltonian in a way that allows much of the movement around the state space to be done at low computational cost. One context where this is possible is when the log density of the distribution of interest (the potential energy function) can be written as the log of a Gaussian density, which is a qu...

متن کامل

Monte Carlo Hamiltonian

We construct an effective Hamiltonian via Monte Carlo from a given action. This Hamiltonian describes physics in the low energy regime. We test it by computing spectrum, wave functions and thermodynamical observables (average energy and specific heat) for the free system and the harmonic oscillator. The method is shown to work also for other local potentials. PACS index: o3.65.-w, 05.10.Ln ∗Cor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastics And Partial Differential Equations: Analysis And Computations

سال: 2021

ISSN: ['2194-0401', '2194-041X']

DOI: https://doi.org/10.1007/s40072-021-00211-z